Distributed goal-directed dynamic plan revision
نویسندگان
چکیده
We contrast in this article the system demands imposed by brute force, complete replanning and a new, goal-directed approach called dynamic plan revision (DPR). One of the two processes must be invoked when some aspects of the environment change and currently existing plans are likely to fail. Complete replanning is conceptually simpler but requires significantly more computation because it reproduces also those plan steps that have not been affected by the changes. DPR attempts to minimize the scope of replanning and makes to the current plans as small amount of modification as possible. The more rapidly the environment changes, the less practical complete replanning becomes. The issue is even more significant with time-critical applications. DPR uses goal hierarchies produced at the same time when plans are generated. The planning systems has an "active attitude" toward the feedback from the environment and takes advantage of all information becoming available during plan execution. We have also developed and implemented a distributed version of this approach in the domain of Distributed Manufacturing Operations12,13. The relevant algorithms are given in the Appendices A and B.
منابع مشابه
Dynamic Logic for Plan Revision in Intelligent Agents
In this paper, we present a dynamic logic for a propositional version of the agent programming language 3APL. A 3APL agent has beliefs and a plan. The execution of a plan changes an agent’s beliefs. Plans can be revised during execution. Due to these plan revision capabilities of 3APL agents, plans cannot be analyzed by structural induction as in for example standard propositional dynamic logic...
متن کاملDynamic Logic for Plan Revision in Agent Programming
In this paper, we present a dynamic logic for a propositional version of the agent programming language 3APL. A 3APL agent has beliefs and a plan. The execution of a plan changes an agent’s beliefs. Plans can be revised during execution by means of plan revision rules. Due to these plan revision capabilities of 3APL agents, plans cannot be analyzed by structural induction as in for example stan...
متن کاملUniversity of Leeds SCHOOL OF COMPUTER STUDIES RESEARCH REPORT SERIES Report 94.21 A Global Plan Policy for Coherent Cooperation in Distributed Dynamic Load Balancing Algorithms
Distributed-controlled dynamic load balancing algorithms are known to have several advantages over centralised algorithms such as scalability, and fault tolerance. Distributed implies that the control is decentralised and that a copy of the algorithm (called a scheduler) is replicated on each host of the network. However, distributed control also contributes to the lack of global goals and lack...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملPlan representation and execution in multi-actor scenarios by means of social commitments
We present an approach to plan representation in multi-actor scenarios that is suitable for flexible replanning and plan revision purposes in dynamic non-deterministic multi-actor environments. The key idea of the presented approach is in representation of the distributed hierarchical plan by social commitments, as a theoretically studied formalism representing mutual relations among intentions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Intell. Syst.
دوره 9 شماره
صفحات -
تاریخ انتشار 1994